Dynamic topological S5
نویسنده
چکیده
The topological semantics for modal logic interprets a standard modal propositional language in topological spaces rather than Kripke frames: the most general logic of topological spaces becomes S4. But othermodal logics can be given a topological semantics by restricting attention to subclasses of topological spaces: in particular, S5 is logic of the class of almost discrete topological spaces, and also of trivial topological spaces. Dynamic Topological Logic (DTL) interprets a modal language enriched with two unary temporal connectives, next and henceforth. DTL interprets the extended language in dynamic topological systems: a DTS is a topological space together with a continuous function used to interpret the temporal connectives. In this paper, we axiomatize four conservative extensions of S5, and show them to be the logic of continuous functions on almost discrete spaces, of homeomorphisms on almost discrete spaces, of continuous functions on trivial spaces and of homeomorphisms on trivial spaces. © 2009 Elsevier B.V. All rights reserved.
منابع مشابه
A Sequent Calculus for Dynamic Topological Logic
We introduce a sequent calculus for the temporal-over-topological fragment DTL ◦∗/2 0 of dynamic topological logic DTL, prove soundness semantically, and prove completeness syntactically using the axiomatization of DTL ◦∗/2 0 given in [3]. A cut-free sequent calculus for DTL ◦∗/2 0 is obtained as the union of the propositional fragment of Gentzen’s classical sequent calculus, two 2 structural r...
متن کاملThe Topological Product of S4 and S5
The most obvious bimodal logic generated from unimodal logics L1 and L2 is their fusion, L1 ⊗L2, axiomatized by the theorems of L1 for 1 and of L2 for 2, and by the rules of modus ponens, substitution and necessitation for 1 and for 2. Shehtman introduced the frame product L1×L2, as the logic of the products of certain Kripke frames. Typically, L1 ⊗ L2 ( L1 × L2, e.g. S4⊗ S4 ( S4× S4. Van Benth...
متن کاملA simplicial complex model of dynamic epistemic logic for fault-tolerant distributed computing
The usual epistemic S5 model for multi-agent systems is a Kripke graph, whose edges are labeled with the agents that do not distinguish between two states. We propose to uncover the higher dimensional information implicit in the Kripke graph, by using as a model its dual, a chromatic simplicial complex. For each state of the Kripke model there is a facet in the complex, with one vertex per agen...
متن کاملReasoning about update logic
Logical frameworks for analysing the dynamics of information processing abound [4, 5, 8, 10, 12, 14, 20, 22]. Some of these frameworks focus on the dynamics of the interpretation process, some on the dynamics of the process of drawing inferences, and some do both of these. Formalisms galore, so it is felt that some conceptual streamlining would pay o . This paper is part of a larger scale enter...
متن کاملProving the Decidability of the Pdl×pdl Product Logic
The propositional dynamic logic (PDL) is an adequate tool to write down programs. In a previous article we used PDL to formulate cryptographic protocols as parallel programs. In these protocols at least two agents/individuals exchange messages, so we needed to use product logic to formulate the parallel actions. Ágnes Kurucz proved that S5×S5×S5 — which is the simplest triple product logic — is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Ann. Pure Appl. Logic
دوره 160 شماره
صفحات -
تاریخ انتشار 2009